ReP USP - Resultado da busca

Parte de monografia/livro
On the triangle removal lemma for subgraphs of sparse pseudorandom graphs (2010)
Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch; Schacht, Mathias; Skokan, Jozef
Source: An irregular mind. Unidade: IME
Subjects: MÉTODOS PROBABILÍSTICOS, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. An irregular mind. Tradução . Berlin: Springer, 2010. . Disponível em: https://doi.org/10.1007/978-3-642-14444-8_10. Acesso em: 02 maio 2024.
APA
Kohayakawa, Y., RÖdlt, V. Ě., Schacht, M., & Skokan, J. (2010). On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. In An irregular mind. Berlin: Springer. doi:10.1007/978-3-642-14444-8_10
NLM
Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2024 maio 02 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10
Vancouver
Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2024 maio 02 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10
Trabalho de evento
Universality of random graphs (2008)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch; Ruciński, Andrzej
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. Universality of random graphs. 2008, Anais.. Philadelphia: SIAM, 2008. Disponível em: https://dl.acm.org/citation.cfm?id=1347168. Acesso em: 02 maio 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., RÖdlt, V. Ě., & Ruciński, A. (2008). Universality of random graphs. In Proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/citation.cfm?id=1347168
NLM
Dellamonica Junior D, Kohayakawa Y, RÖdlt VĚ, Ruciński A. Universality of random graphs [Internet]. Proceedings. 2008 ;[citado 2024 maio 02 ] Available from: https://dl.acm.org/citation.cfm?id=1347168
Vancouver
Dellamonica Junior D, Kohayakawa Y, RÖdlt VĚ, Ruciński A. Universality of random graphs [Internet]. Proceedings. 2008 ;[citado 2024 maio 02 ] Available from: https://dl.acm.org/citation.cfm?id=1347168
Parte de monografia/livro
Szemerédi's regularity lemma and quasi-randominess (2003)
Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch
Source: Recent advances in algorithms and combinatorics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RÖDLT, VojtĚch. Szemerédi's regularity lemma and quasi-randominess. Recent advances in algorithms and combinatorics. Tradução . New York: Springer, 2003. . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/0-387-22444-0_9. Acesso em: 02 maio 2024.
APA
Kohayakawa, Y., & RÖdlt, V. Ě. (2003). Szemerédi's regularity lemma and quasi-randominess. In Recent advances in algorithms and combinatorics. New York: Springer. doi:10.1007/0-387-22444-0_9
NLM
Kohayakawa Y, RÖdlt VĚ. Szemerédi's regularity lemma and quasi-randominess [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 maio 02 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/0-387-22444-0_9
Vancouver
Kohayakawa Y, RÖdlt VĚ. Szemerédi's regularity lemma and quasi-randominess [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 maio 02 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/0-387-22444-0_9

USP Schools

ReP

Filtros

Authors

Funding Agencies